Counting suffix arrays and strings
نویسندگان
چکیده
منابع مشابه
Counting Suffix Arrays and Strings
Suffix arrays are used in various application and research areas like data compression or computational biology. In this work, our goal is to characterize the combinatorial properties of suffix arrays and their enumeration. For fixed alphabet size and string length we count the number of strings sharing the same suffix array and the number of such suffix arrays. Our methods have applications to...
متن کاملSuffix Arrays for Structural Strings
The structural match (s-match), originally addressed by the structural suffix tree, helps identify different RNA sequences with the same secondary structure. In this work, we introduce and construct the structural suffix array and structural longest common prefix array, i.e. lightweight suffix data structures for the s-match. Further, we illustrate how to use our data structures to support addi...
متن کاملAlgorithms on Strings based on the Compressed Suffix Arrays
A4J88!:w$N$?$a$N:w0z$G$"$k@\Hx<-G[Ns$O, B>$NA4J88!:w:w0z$HHf3S$9$k$H>J%9%Z!<%9$G$"$k$,, E>CV%U%!%$%k$N$h$&$JC18l:w0z$HHf3S$9$k$H%5%$%:$,Bg$-$$. $3$NLdBj$r2r7h$9$k$?$a$K05=L@\Hx.$5$/ $J$i$J$$. K\9F$G$O05=L@\Hx<-G[Ns$rMQ$$$?8!:w%"%k%4%j%:%‘$r, %F%-%9%H<+?H$,ITMW$K$J$k$h$&$KJQ99$9 $k. $ $̂?, %F%-%9%HA4BN$d$=$N0lIt...
متن کاملEfficient repeat finding in sets of strings via suffix arrays
We consider two repeat finding problems relative to sets of strings: (a) Find the largest substrings that occur in every string of a given set; (b) Find the maximal repeats in a given string that occur in no string of a given set. Our solutions are based on the suffix array construction, requiring O(m) memory, where m is the length of the longest input string, and O(n logm) time, where n is the...
متن کاملSuffix Trees and Suffix Arrays
Iowa State University 1.1 Basic Definitions and Properties . . . . . . . . . . . . . . . . . . . . 1-1 1.2 Linear Time Construction Algorithms . . . . . . . . . . . . . 1-4 Suffix Trees vs. Suffix Arrays • Linear Time Construction of Suffix Trees • Linear Time Construction of Suffix Arrays • Space Issues 1.3 Applications . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2008
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2008.01.011